Explorative anytime local search for distributed constraint optimization
نویسندگان
چکیده
منابع مشابه
Explorative anytime local search for distributed constraint optimization
Distributed Constraint Optimization Problems (DCOPs) are an elegant model for representing and solving many realistic combinatorial problems that are distributed by nature. DCOPs are NP-hard and therefore many recent studies consider incomplete algorithms for solving them. Distributed local search algorithms, in which agents in the system hold value assignments to their variables and iterativel...
متن کاملAnytime local search for distributed constraint optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system’s state and the private evaluation of states by agents, agents ar...
متن کاملAnytime Local Search for Distributed Constraint Optimization (Short Paper)
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system’s state and the private evaluation of states by agents, agents ar...
متن کاملLocal Algorithms for Distributed Constraint Optimization in Dynamic, Anytime Environments
Many challenges in multi-agent coordination can be modeled as distributed constraint optimization problems (DCOPs) but existing complete algorithms do not scale well nor respond effectively to dynamic or anytime environments. As we move towards a future of ambient intelligence, in which large groups of agents must quickly coordinate, these deficiencies must be addressed. We decompose DCOP into ...
متن کاملDistributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed but instead a doubling of the number of cores. Unfortunately, it also places significant conceptual and implementation burden on programmers. This paper aims at addressing this challenge for constraint-based local sea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2014
ISSN: 0004-3702
DOI: 10.1016/j.artint.2014.03.002